A note on parallel algorithms for optimal h-v drawings of binary trees

摘要

In this paper we present a method to obtain optimal h-v drawings in parallel. Basedon parallel tree contraction, our method computes optimal (with respect to a class ofcost functions of the enclosing rectangle) drawings in O(log2n) parallel time by using apolynomial number of EREW processors. The number of processors reduces substantiallywhen we study minimum area drawings. Our work places the